|
Title:
|
{SETS} A LIGHTWEIGHT CONSTRAINT PROGRAMMING LANGUAGE BASED ON ROBDDS |
|
Author(s):
|
Haim Cohen , Stephen A. Edwards |
|
ISBN:
|
978-972-8924-30-0 |
|
Editors:
|
Nuno Guimarães and Pedro Isaías |
|
Year:
|
2007 |
|
Edition:
|
Single |
|
Keywords:
|
Constraint Programming, Constraint Satisfaction Problem, Programming Languages, Binary Decision Diagrams, BDDs |
|
Type:
|
Short Paper |
|
First Page:
|
609 |
|
Last Page:
|
614 |
|
Language:
|
English |
|
Cover:
|
|
|
Full Contents:
|
click to dowload 
|
|
Paper Abstract:
|
Constraint programming is a step toward ideal programming: you merely define the problem domain and the constraints the solution must meet and let the computer do the rest. Many constraint programming languages have been developed; the majority of them employ iterative constraint propagation over the problem variables. While such an approach solves many problems and can handle very rich data types, it is often too inefficient to be practical. To address this problem, we developed a constraint programming language called {sets} that uses reduced ordered binary decision diagrams (ROBDDs) as the solution engine. Providing a minimal syntax, the language can be used to solve many finite problems that fit the constraint programming paradigm. The minimal syntax and simple semantics of the language enable the user to create libraries customized for a specific problem domain. {sets} is particularly useful in problems where an efficient search algorithm yet know to exist or can not be developed due to time constraints. As long as the solution domain is finite and discrete, {sets} should be able to describe the problem and search for a solution. We describe the {sets} language through a series of examples, show how it is compiled into C++ code that uses a public-domain ROBDD library, and compare the performance of this language with other constraint languages. |
|
|
|
|
|
|
